Dynamic multi-period vehicle routing with touting

This paper introduces a dynamic multi-period vehicle routing problem with touting as demand management technique, where customers that have not yet placed an order can be actively encouraged to service sooner. Touting the right customers, such those located nearby who already orders, allows for more efficient routes over time. However, it also increases frequency of visits at touted they are serviced before would normally require, which leads smaller volumes per visit. To tackle this trade-off, we propose several strategies decide tout and when, using characteristics well current plan time touting. Specifically, location information, approach ones close tour, relatively far from depot likely easily covered in near future. information is then used part different strategies, further embedded rolling-time horizon algorithm address nature problem. These empirically compared simulation based on real-world waste collection We demonstrate indeed significantly reduce travel distance